|
The Chebyshev pseudospectral method for optimal control problems is based on Chebyshev polynomials of the first kind. It is part of the larger theory of pseudospectral optimal control, a term coined by Ross. Unlike the Legendre pseudospectral method, the Chebyshev pseudospectral (PS) method does not immediately offer high-accuracy quadrature solutions. Consequently, two different versions of the method have been proposed: one by Elnagar et al., and another by Fahroo and Ross. The two versions differ in their quadrature techniques. The Fahroo–Ross method is more commonly used today due to the ease in implementation of the Clenshaw–Curtis quadrature technique (in contrast to Elnagar–Kazemi's cell-averaging method). In 2008, Trefethen showed that the Clenshaw–Curtis method was nearly as accurate as Gauss quadrature. This breakthrough result opened the door for a covector mapping theorem for Chebyshev PS methods. A complete mathematical theory for Chebyshev PS methods was finally developed in 2009 by Gong, Ross and Fahroo.〔Q. Gong, I. M. Ross and F. Fahroo, A Chebyshev Pseudospectral Method for Nonlinear Constrained Optimal Control Problems, Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference Shanghai, P.R. China, December 16–18, 2009〕 ==Other Chebyshev methods== The Chebyshev PS method is frequently confused with other Chebyshev methods. Prior to the advent of PS methods, many authors proposed using Chebyshev polynomials to solve optimal control problems; however, none of these methods belong to the class of pseudospectral methods. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Chebyshev pseudospectral method」の詳細全文を読む スポンサード リンク
|